Unsatisfiable (k,(4*2^k/k))-CNF formulas
نویسنده
چکیده
A Boolean formula in a conjunctive normal form is called a (k, s)-formula if every clause contains exactly k variables and every variable occurs in at most s clauses. We show that there are unsatisfiable (k, 4 · 2 k
منابع مشابه
ar X iv : 0 70 8 . 23 36 v 1 [ cs . D M ] 1 7 A ug 2 00 7 Unsatisfiable Linear k - CNFs Exist , for every k
We call a CNF formula linear if any two clauses have at most one variable in common. Let Linear k-SAT be the problem of deciding whether a given linear k-CNF formula is satisfiable. Here, a k-CNF formula is a CNF formula in which every clause has size exactly k. It was known that for k ≥ 3, Linear k-SAT is NP-complete if and only if an unsatisfiable linear k-CNF formula exists, and that they do...
متن کاملUnsatisfiable Linear k-CNFs Exist, for every k
We call a CNF formula linear if any two clauses have at most one variable in common. Let Linear k-SAT be the problem of deciding whether a given linear k-CNF formula is satisfiable. Here, a k-CNF formula is a CNF formula in which every clause has size exactly k. It was known that for k ≥ 3, Linear k-SAT is NP-complete if and only if an unsatisfiable linear k-CNF formula exists, and that they do...
متن کاملUnsatisfiable Linear CNF Formulas Are Large and Complex
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k4 clauses, and on the other hand, any linear k-CNF formula with at most 4 k 8ek clauses is satisfiable. The upper bound uses probabilistic means, and we have no explicit construction coming even close to it. One reason for this is that ...
متن کاملUnsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most O(k4) clauses, and on the other hand, any linear k-CNF formula with at most 4 k 4e2k3 clauses is satisfiable. The upper bound uses a probabilistic construction, and we have no explicit construction coming even close to it. We give some ar...
متن کاملHow Many Conflicts Does It Need to Be Unsatisfiable?
A pair of clauses in a CNF formula constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other. Clearly, a CNF formula has to have conflicts in order to be unsatisfiable—in fact, there have to be many conflicts, and it is the goal of this paper to quantify how many. An unsatisfiable k-CNF has at least 2 clauses; a lower bound of 2 for the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0810.1904 شماره
صفحات -
تاریخ انتشار 2008